Local Rademacher Complexity for Multi-Label Learning

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning

Niloofar Yousefi, Yunwen Lei , Marius Kloft Mansooreh Mollaghasemi and Georgios Anagnostopoulos Department of Electrical Engineering and Computer Science, University of Central Florida Department of Mathematics, City University of Hong Kong Department of Computer Science, Humboldt University of Berlin Department of Industrial Engineering & Management Systems, University of Central Florida Depar...

متن کامل

Learning Kernels Using Local Rademacher Complexity

We use the notion of local Rademacher complexity to design new algorithms for learning kernels. Our algorithms thereby benefit from the sharper learning bounds based on that notion which, under certain general conditions, guarantee a faster convergence rate. We devise two new learning kernel algorithms: one based on a convex optimization problem for which we give an efficient solution using exi...

متن کامل

The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning

We derive an upper bound on the local Rademacher complexity of lp-norm multiple kernel learning, which yields a tighter excess risk bound than global approaches. Previous local approaches aimed at analyzed the case p = 1 only while our analysis covers all cases 1 ≤ p ≤ ∞, assuming the different feature mappings corresponding to the different kernels to be uncorrelated. We also show a lower boun...

متن کامل

The Local Rademacher Complexity of `p-Norm Multiple Kernel Learning

We derive an upper bound on the local Rademacher complexity of `p-norm multiple kernel learning, which yields a tighter excess risk bound than global approaches. Previous local approaches analyzed the case p = 1 only while our analysis covers all cases 1 ≤ p ≤ ∞, assuming the different feature mappings corresponding to the different kernels to be uncorrelated. We also show a lower bound that sh...

متن کامل

Permutational Rademacher Complexity - A New Complexity Measure for Transductive Learning

Abstract. Transductive learning considers situations when a learner observes m labelled training points and u unlabelled test points with the final goal of giving correct answers for the test points. This paper introduces a new complexity measure for transductive learning called Permutational Rademacher Complexity (PRC) and studies its properties. A novel symmetrization inequality is proved, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Image Processing

سال: 2016

ISSN: 1057-7149,1941-0042

DOI: 10.1109/tip.2016.2524207